Role-Engineering Optimization with Cardinality Constraints and User-Oriented Mutually Exclusive Constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Submodular Maximization with Cardinality Constraints

We consider the problem of maximizing a (non-monotone) submodular function subject to a cardinality constraint. In addition to capturing well-known combinatorial optimization problems, e.g., Maxk-Coverage and Max-Bisection, this problem has applications in other more practical settings such as natural language processing, information retrieval, and machine learning. In this work we present impr...

متن کامل

Concept Descriptions with Set Constraints and Cardinality Constraints

We introduce a new description logic that extends the well-known logic ALCQ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of ALCQ. To formulate these constraints, we use the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), in which one can express Boolean combinations of set constraints an...

متن کامل

Portfolio Optimization with Cardinality Constraints Based on Hybrid Differential Evolution

A portfolio optimal model with cardinality constraints is researched, in which the minimum of Value-at-Risk is taken as the objective function. We give a hybrid differential evolution algorithm to solve the model and make the case study with sixteen alternative stocks from Shanghai and Shenzhen stock market. The numerical results show that the given model is reasonable and the given algorithm i...

متن کامل

A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors

We introduce a new description logic that extends the wellknown logic ALCQ by allowing the statement of constraints on role successors that are more general than the qualified number restrictions of ALCQ. To formulate these constraints, we use the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA), in which one can express Boolean combinations of set constraints and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information

سال: 2019

ISSN: 2078-2489

DOI: 10.3390/info10110342